Bounds Based on the Augmented Lagrangian and Lagrangian Relaxation Algorithms ∗
نویسندگان
چکیده
For a given iterate generated by the augmented Lagrangian or the Lagrangian relaxation based method, we derive estimates for the distance to the primal solution of the underlying optimization problem. The estimates are obtained using some recent contributions to the sensitivity theory, under appropriate first or second order sufficient optimality conditions. The given estimates hold in situations where known (algorithm-independent) error bounds may not apply. Examples are provided which show that the estimates are sharp.
منابع مشابه
Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملSolving Environmental/Economic Power Dispatch Problem by a Trust Region Based Augmented Lagrangian Method
This paper proposes a Trust-Region Based Augmented Method (TRALM) to solve a combined Environmental and Economic Power Dispatch (EEPD) problem. The EEPD problem is a multi-objective problem with competing and non-commensurable objectives. The TRALM produces a set of non-dominated Pareto optimal solutions for the problem. Fuzzy set theory is employed to extract a compromise non-dominated sol...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستارهای؛ مدلبندی، خطیسازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملA Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملFinite Element Solutions of Cantilever and Fixed Actuator Beams Using Augmented Lagrangian Methods
In this paper we develop a numerical procedure using finite element and augmented Lagrangian meth-ods that simulates electro-mechanical pull-in states of both cantilever and fixed beams in microelectromechanical systems (MEMS) switches. We devise the augmented Lagrangian methods for the well-known Euler-Bernoulli beam equation which also takes into consideration of the fringing effect of electr...
متن کامل